Semipullbacks of labelled Markov processes
نویسندگان
چکیده
A labelled Markov process (LMP) consists of a measurable space S together with an indexed family of Markov kernels from S to itself. This structure has been used to model probabilistic computations in Computer Science, and one of the main problems in the area is to define and decide whether two LMP S and S′ “behave the same”. There are two natural categorical definitions of sameness of behavior: S and S′ are bisimilar if there exist an LMP T and measure preserving maps forming a diagram of the shape S ← T → S′; and they are behaviorally equivalent if there exist some U and maps forming a dual diagram S → U ← S′. These two notions differ for general measurable spaces but Edalat proved that they coincide for analytic Borel spaces, showing that from every diagram S → U ← S′ one can obtain a bisimilarity diagram as above. Moreover, the resulting square of measure preserving maps is commutative (a semipullback). In this paper, we extend Edalat’s result to measurable spaces S isomorphic to a universally measurable subset of a Polish space with the trace of the Borel σ-algebra, using a version of Strassen’s theorem on common extensions of finitely additive measures.
منابع مشابه
Approximating labelled Markov processes
Labelled Markov processes are probabilistic versions of labelled transition systems. In general, the state space of a labelled Markov process may be a continuum. In this paper, we study approximation techniques for continuous-state labelled Markov processes. We show that the collection of labelled Markov processes carries a Polish-space structure with a countable basis given by finite-state Mar...
متن کاملLabelled Markov Processes
Labelled Markov processes are probabilistic versions of labelled transition systems. Labelled transition systems where the final state is.. Labelled Markov processes are probabilistic versions of labelled transition systems. Labelled transition systems where the final state is.. Systems that can be in a state and have transitions between states; these transitions are triggered by actions. The t...
متن کاملBisimulation for Labelled Markov Processes
In this paper we introduce a new class of labelled transition systems Labelled Markov Processes and define bisimulation for them. Labelled Markov processes are probabilistic labelled transition systems where the state space is not necessarily discrete, it could be the reals, for example. We assume that it is a Polish space (the underlying topological space for a complete separable metric space)...
متن کاملDomain theory, testing and simulation for labelled Markov processes
This paper presents a fundamental study of similarity and bisimilarity for labelled Markov processes. The main results characterize similarity as a testing preorder and bisimilarity as a testing equivalence. In general, labelled Markov processes are not required to satisfy a finite-branching condition—indeed the state space may be a continuum, with the transitions given by arbitrary probability...
متن کاملOn $L_1$-weak ergodicity of nonhomogeneous continuous-time Markov processes
In the present paper we investigate the $L_1$-weak ergodicity of nonhomogeneous continuous-time Markov processes with general state spaces. We provide a necessary and sufficient condition for such processes to satisfy the $L_1$-weak ergodicity. Moreover, we apply the obtained results to establish $L_1$-weak ergodicity of quadratic stochastic processes.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1706.02801 شماره
صفحات -
تاریخ انتشار 2017